Skip to main content
SpringerLink
Log in

Constructing a block layout by face area

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Solving the facility layout problems by graph theory consists of two stages. In the first stage, a planar graph that specifies desired adjacencies is obtained and in the second stage, a block layout is achieved from the planar graph. In this paper, we introduce face area as a new concept for constructing a block layout. Based on this idea, we present a new algorithm for constructing block layout from a maximal planar graph (MPG). This MPG must be generated from deltahedron heuristic. Constructed block layout by this algorithm satisfies all of adjacency and area requirements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Singh SP, Sharma RRK (2006) review of different approaches to the facility layout problem. Int J Adv Manuf Technol 30:425–433

    Article  Google Scholar 

  2. Tompkins JA, White JA et al (1996) Facilities planning. Wiley, New York

    Google Scholar 

  3. Foulds LR (1991) Graph theory and applications. Springer, Berlin

    Google Scholar 

  4. Hassan MMD, Hogg GL (1987) A review of graph theory applications to the facilities layout problem. Omega 15:291–300

    Article  Google Scholar 

  5. Foulds LR, Robinson DF (1978) Graph theoretic heuristics for the plant layout problem. Int J Prod Res 16:27–37

    Article  Google Scholar 

  6. John EG, Hammond J (2000) A maximally weighted graph theoretic facilities design planning. Int J Prod Res 38(16):3845–3859

    Article  MATH  Google Scholar 

  7. Osman I, Al-Ayoubi B, Barake M (2003) A greedy random adaptive search procedure for the weighted maximal planar graph problem. Comput Ind Eng 45:635–651

    Article  Google Scholar 

  8. Osman I (2006) A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem. Comput Oper Res 33:2526–2546

    Article  MathSciNet  MATH  Google Scholar 

  9. Hassan MMD, Hogg GL (1989) On converting a dual graph into a block layout. Int J Prod Res 27(7):1149–1160

    Article  Google Scholar 

  10. Giffin JW, Watson KH, Foulds LR (1995) Orthogonal layouts using the Deltahedron heuristic. Australas J Combin 12:127–144

    MathSciNet  MATH  Google Scholar 

  11. Welgama S, Gibson R, Al-Hakim LA (1994) Facilities layout: a knowledge-based approach for converting a dual graph into a block layout. Int J Prod Econ 33:17–30

    Article  Google Scholar 

  12. Watson KH, Giffin JW (1997) The vertex splitting algorithm for facilities layout. Int J Prod Res 35(9):2477–2492

    Article  MATH  Google Scholar 

  13. Irvine SA, Rinsma-Melchert I (1997) A new approach to the block layout problem. Int J Prod Res 35(8):2359–2376

    Article  MATH  Google Scholar 

  14. Green RH, Al-Hakim LA (1985) A heuristic for facilities layout planning. Omega 13(5):469–474

    Article  Google Scholar 

  15. Boswell SG (1992) TESSA a new greedy algorithm for facilities layout planning. Int J Prod Res 30:1957–1968

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Sharif University of Technology, Azadi Street, Tehran, Iran

    Mohammad Reza Akbari Jokar & Ali Shoja Sangchooli

Authors
  1. Mohammad Reza Akbari Jokar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Shoja Sangchooli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Shoja Sangchooli.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akbari Jokar, M.R., Shoja Sangchooli, A. Constructing a block layout by face area. Int J Adv Manuf Technol 54, 801–809 (2011). https://doi.org/10.1007/s00170-010-2960-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2960-4

Keywords

Search

Navigation